Time complexity

Results: 894



#Item
401Analysis of algorithms / Switches / Randomized algorithm / Logic gate / PP / Network switch / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics

IEEE TRANSACTIONS ON COMPUTERS, VOL. 54, NO. 9, SEPTEMBER 2005

Add to Reading List

Source URL: www.ece.rice.edu

Language: English - Date: 2012-08-15 21:57:03
402Complexity classes / Mathematical optimization / Structural complexity theory / Computational resources / P versus NP problem / NP-complete / Circuit complexity / P / Time hierarchy theorem / Theoretical computer science / Computational complexity theory / Applied mathematics

Parameterized Algorithms and Circuit Lower Bounds Ryan Williams Stanford

Add to Reading List

Source URL: fpt.wdfiles.com

Language: English - Date: 2013-02-02 11:07:07
403Complexity classes / NP-complete problems / Analysis of algorithms / Parameterized complexity / NP-complete / Vertex cover / Time complexity / Travelling salesman problem / Matching / Theoretical computer science / Computational complexity theory / Applied mathematics

WO RKSHO P O N PARAM ETERI ZED CO M PLEXI TY http:/ / fpt.wikidot.com 30&31 March 2010 The University of Newcastle, AU ABSTRACTS OF TALKS

Add to Reading List

Source URL: fpt.wdfiles.com

Language: English - Date: 2012-09-17 04:49:01
404Parameterized complexity / Analysis of algorithms / Time complexity / NP-complete problems / Algorithm / Theoretical computer science / Applied mathematics / Computational complexity theory

Fixed-Parameter Algorithms for Covering Points with Lines Apichat Heednacram PhD Student Supervisors: Prof. Vladimir Estivill-Castro

Add to Reading List

Source URL: fpt.wdfiles.com

Language: English - Date: 2012-09-17 05:11:27
405Operations research / Dynamic programming / Analysis of algorithms / Algorithm / Mathematical logic / Longest increasing subsequence / Sorting algorithm / Time complexity / Greedy algorithm / Mathematics / Theoretical computer science / Applied mathematics

CS 373 Homework 1 (dueSpring 1999

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 08:54:08
406Coding theory / Analysis of algorithms / Computational complexity theory / Closest string / Hamming distance / Time complexity / Algorithmica / Theoretical computer science / Applied mathematics / NP-complete problems

Local Search for String Problems: Brute Force is Essentially Optimal Jiong Guo, Danny Hermelin, Christian Komusiewicz Universit¨ at des Saarlandes, Ben-Gurion University, TU Berlin & Universit´

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2013-07-26 10:03:32
407Mathematical logic / Sorting algorithms / Asymptotic analysis / Algorithm / Time complexity / Quicksort / Factorial / K-d tree / Heap / Mathematics / Theoretical computer science / Analysis of algorithms

CS 373: Combinatorial Algorithms, Fall 2000 Midterm 1 — October 3, 2000 Name: Net ID:

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 08:48:14
408Triangulation / Analysis of algorithms / Delaunay triangulation / Gabriel graph / Time complexity / Algorithm / Theoretical computer science / Applied mathematics / Mathematics

CCCG 2011, Toronto ON, August 10–12, 2011 A Slow Algorithm for Computing the Gabriel Graph with Double Precision David L. Millman Abstract

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:16
409Distributed computing / Electronics / Clock synchronization / Clock skew / Breadth-first search / Computing / Computer programming / Distributed algorithms / Synchronizer / Synchronization

102 complexity of the resulting asynchronous algorithm depends on the overhead introduced by the synchronizer. For a synchronizer S, let T (S) and M (S) be the time and message complexities of S for each generated clock

Add to Reading List

Source URL: dcg.ethz.ch

Language: English - Date: 2014-09-26 08:28:48
410Analysis of algorithms / Arithmetic / Mathematical notation / Summation / Recurrence relation / Time complexity / Computational complexity theory / NP / Merge sort / Theoretical computer science / Mathematics / Applied mathematics

CS109A Notes for LectureAnalysis of Mergesort Input size n = length of list to be sorted; Tms(n) = running time of mergesort. 1. Call split on list of length n; takes O(n) time

Add to Reading List

Source URL: infolab.stanford.edu

Language: English - Date: 2008-09-19 00:58:00
UPDATE